A New Method for Constructing Phylogenetic Trees by Information Theoretical Measure
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A method for investigating relative timing information on phylogenetic trees.
In this paper, we present a new way to describe the timing of branching events in phylogenetic trees. Our description is in terms of the relative timing of diversification events between sister clades; as such it is complementary to existing methods using lineages-through-time plots which consider diversification in aggregate. The method can be applied to look for evidence of diversification ha...
متن کاملUnderstanding phylogenies: Constructing and Interpreting Phylogenetic trees
Interpretation of phylogenetic trees is fundamental in understanding the relationships between organisms, their traits or characteristics, their ecology and even their genomic and developmental biology. As trees appear more often in basic texts, many students, and even their teachers, clearly understand little of how they are constructed and even less about what can be inferred from them about ...
متن کاملConstructing Phylogenetic Trees Using Maximum Likelihood
Maximum likelihood methods are used to estimate the phylogenetic trees for a set of species. The probabilities of DNA base substitutions are modeled by continuous-time Markov chains. We use these probabilities to estimate which DNA bases would produce the data that we observe. The topology of the tree is also determined using base substitution probabilities and conditional likelihoods. Felsenst...
متن کاملConstructing phylogenetic trees efficiently using compatibility criteria
The Character Compatibility Problem is a classical problem in computational biology concerned with constructing phylogenetic trees of minimum possible evolution from qualitative character sets. This problem arose in the 1970s, and until recently the only cases for which efficient algorithms were found were for binary (i.e. twostate) characters and for two characters at a time, while the complex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Seibutsu Butsuri
سال: 1990
ISSN: 0582-4052,1347-4219
DOI: 10.2142/biophys.30.30